Ruspacelog N Dspacelog 2 N= Log Log N
نویسنده
چکیده
We present a deterministic algorithm running in space O log n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
منابع مشابه
Directed domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملDomain of attraction of normal law and zeros of random polynomials
Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...
متن کاملFractional Hermite-Hadamard type inequalities for n-times log-convex functions
In this paper, we establish some Hermite-Hadamard type inequalities for function whose n-th derivatives are logarithmically convex by using Riemann-Liouville integral operator.
متن کاملOn Strong Separations from AC
1 SUMMARY As part of a study of almost-everywhere complex sets, we i n vestigate sets that are immune to AC 0 ; that is, sets with no innnite subset in AC 0. W e show that such sets exist in P PP and in DSPACElog n log n. Our main result is an oracle construction indicating that any improvement in these immunity results will represent a signiicant advance, in that we show that any answer to the...
متن کاملStirling’s Formula
Theorem 2.1. For all n ≥ 1, n log n− n < log(n!) < n log n, so log(n!) ∼ n log n. Proof. The inequality log(n!) < n log n is a consequence of the trivial inequality n! < nn. Here are three methods of showing n log n− n < log(n!). Method 1: A Riemann sum approximation for ∫ n 1 log x dx using right endpoints is log 2+ · · ·+ log n = log(n!), which overestimates, so log(n!) > ∫ n 1 log x dx = n l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998